A SOLUTION FOR THE BI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING LOCAL SEARCH AND GENETIC ALGORITHMS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms

   In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...

متن کامل

An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

متن کامل

Waste Collection Vehicle Routing Problem with Time Windows Using Multi-objective Genetic Algorithms

We study a waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and driver’s lunch breaks. Recently Kim et al. [1] introduced and addressed this problem using an extension of the well-known Solomon’s insertion approach, and a clustering-based algorithm. We propose and present the results of an initial study of a multi-objective genetic algori...

متن کامل

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows

This report presents a survey of research on the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval, all routes start and end at the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: INTERNATIONAL JOURNAL FOR TRAFFIC AND TRANSPORT ENGINEERING

سال: 2016

ISSN: 2217-544X,2217-5652

DOI: 10.7708/ijtte.2016.6(2).03